package acwing.算法进阶打卡;/**
 * @author： li
 * @date： 2022-03-14 13:12
 * @version 1.0
 */
import java.util.*;
public class 约数之和_约数定理 {
    static int sum(int i,int c){
    if(c==0)
        return 1;
    if((c&1)==0)
        return (i%9901*sum(i,c-1)+1)%9901;
    return ((qmi(i, c/2 + 1)+1) * sum(i, c >> 1) % 9901);
    }
    static int qmi(int a, int k) {
        a %= 9901;
        int res = 1;
        while (k != 0) {
            if ((k & 1) == 1)
                res = res * a % 9901;
            a = a * a % 9901;
            k >>= 1;
        }
        return res;
    }
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int a,b;
        a= sc.nextInt();
        b=sc.nextInt();
//        long ans=qmi(a,b);
        //分解质因数
        int res=1;
        for(int i=2;i<=a;i++){
            int count=0;
            while (a% i == 0) {
                count++;
                a /= i;
            }
            if(count>0) {
//                System.out.print(i + " ");
                res=res*sum(i,count*b)%9901;
            }
        }
        if(a==0)
            res = 0;
            System.out.println(res);

        sc.close();
    }
}